#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qmi(ll a, ll b)
{
    ll res = 1;
    while (b)
    {
        if (b & 1)
            res = res * a % mod;
        b >>= 1;
        a = a * a % mod;
    }
    return res;
}
struct custom_hash
{
    static uint64_t splitmix64(uint64_t x)
    {
        x ^= x << 13;
        x ^= x >> 7;
        x ^= x << 17;
        return x;
    }
    size_t operator()(uint64_t x) const
    {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); // 时间戳
        return splitmix64(x + FIXED_RANDOM);
    }
};

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n), b(n), c(n);
    ll sum = 0;
    vector<ll> pre1(n + 1), pre2(n + 1), pre3(n + 1);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        pre1[i + 1] = pre2[i] + a[i];
    }
    for (int i = 0; i < n; i++)
    {
        cin >> b[i];
        pre2[i + 1] = pre2[i] + b[i];
    }    
    for (int i = 0; i < n; i++)
    {
        cin >> c[i];
        pre3[i + 1] = pre3[i] + c[i];
    }    
    ll t = (sum + 2) / 3;
    sum = 0;
    for(int l = 1, r = 1; r++; r < n)
    {
        sum += a[r];
        while(sum >= t)
        {
            if()
        }

    }
}
int main()
{
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}